package leetcode.lt100;

class Solution_72 {
	public int minDistance(String word1, String word2) {
		int m = word1.length();
		int n = word2.length();

		int[][] dp = new int[m + 1][n + 1];

		for (int i = 0; i <= m; i++) {
			dp[i][0] = i;
		}

		for (int i = 0; i <= n; i++) {
			dp[0][i] = i;
		}

		int cost;

		for (int i = 1; i <= m; i++) {
			for (int j = 1; j <= n; j++) {
				dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
				cost = word1.charAt(i - 1) == word2.charAt(j - 1) ? 0 : 1;
				dp[i][j] = Math.min(dp[i][j], dp[i - 1][j - 1] + cost);
			}
		}

		return dp[m][n];
	}
}